On the Volume of a Certain Polytope
نویسندگان
چکیده
Let n ≥ 2 be an integer and consider the set Tn of n× n permutation matrices π for which πij = 0 for j ≥ i+ 2. In this paper we study the convex hull of Tn, which we denote by Pn. Pn is a polytope of dimension ( n 2 ) . Our main purpose is to provide evidence for the following conjecture concerning its volume. Let vn denote the minimum volume of a simplex with vertices in the affine lattice spanned by Tn. Then the volume of Pn is vn times the product
منابع مشابه
A remark on asymptotic enumeration of highest weights in tensor powers of a representation
We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...
متن کاملEffect of IL-2 co-expressed or co-inoculated with immuno-dominant epitopes from VP1 protein of FMD virus on immune responses in BALB/c mice
Objective(s): The results of studies on vaccine development for foot-and-mouth disease (FMD) virus show that the use of inactivated vaccines for FMD virus is not completely effective. Novel vaccinations based on immuno-dominant epitopes have been shown to induce immune responses. Furthermore, for safety of immunization, access to efficient adjuvants against FMD virus seems to be critical.Materi...
متن کاملGeneralized Parking Functions, Descent Numbers, and Chain Polytopes of Ribbon Posets
We consider the inversion enumerator In(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = −1 into this generalized polynomial produces the number of permutations with a certain descent set. In the classical case, this result implies the formula In(−1) = En, the number of alternating perm...
متن کاملHigher integrality conditions, volumes and Ehrhart polynomials
A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a lattice-face polytope are volumes of projections of the polytope. We generalize both results by introducing a notion of k-integral polytopes, where 0-integral is eq...
متن کاملThe Boundary Volume of a Lattice Polytope
For a d-dimensional convex lattice polytope P , a formula for the boundary volume vol(∂P ) is derived in terms of the number of boundary lattice points on the first bd/2c dilations of P . As an application we give a necessary and sufficient condition for a polytope to be reflexive, and derive formulae for the f -vector of a smooth polytope in dimensions 3, 4, and 5. We also give applications to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Experimental Mathematics
دوره 9 شماره
صفحات -
تاریخ انتشار 2000